Carathéodory bounds for integer cones
نویسندگان
چکیده
Let b ∈ Zd be an integer conic combination of a finite set of integer vectors X ⊂ Zd . In this note we provide upper bounds on the size of a smallest subset X̃ ⊆ X such that b is an integer conic combination of elements of X̃ . We apply our bounds to general integer programming and to the cutting stock problem and provide an NP certificate for the latter, whose existence has not been known so far.
منابع مشابه
Diophantine Approximations and Integer Points of Cones
The purpose of this note is to present a relation between directed best approximations of a rational vector and the elements of the minimal Hilbert basis of certain rational pointed cones. Furthermore, we show that for a special class of these cones the integer Carathéodory property holds true.
متن کاملThe Price of Order
We present tight bounds on the spanning ratio of a large family of ordered θ-graphs. A θ-graph partitions the plane around each vertex into m disjoint cones, each having aperture θ = 2π/m. An ordered θ-graph is constructed by inserting the vertices one by one and connecting each vertex to the closest previously-inserted vertex in each cone. We show that for any integer k ≥ 1, ordered θ-graphs w...
متن کاملA bound on the Carathéodory number
The Carathéodory number κ(K) of a pointed closed convex cone K is the minimum among all the κ for which every element of K can be written as a nonnegative linear combination of at most κ elements belonging to extreme rays. Carathéodory’s Theorem gives the bound κ(K) ≤ dimK. In this work we observe that this bound can be sharpened to κ(K) ≤ `K−1, where `K is the length of the longest chain of no...
متن کاملOptimal Bounds on Theta-Graphs: More is not Always Better
We present tight upper and lower bounds on the spanning ratio of a large family of θ-graphs. We show that θgraphs with 4k+2 cones (k ≥ 1 and integer) have a spanning ratio of 1 + 2 sin(θ/2), where θ is 2π/(4k + 2). We also show that θ-graphs with 4k + 4 cones have spanning ratio at least 1 + 2 tan(θ/2) + 2 tan(θ/2), where θ is 2π/(4k + 4). This is somewhat surprising since, for equal values of ...
متن کاملLargest minimal inversion - complete and pair - complete sets of permutations 1
The Carathéodory, Helly, and Radon numbers are three main invariants in convexity theory. They relate, respectively, to minimal representations of points in a convex hull; to the size of minimal infeasible inequality systems; and to VC-dimensions and the existence of centerpoints (generalized medians). These invariants have been determined, exactly or approximately, for a number of different co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 34 شماره
صفحات -
تاریخ انتشار 2006